全文获取类型
收费全文 | 1090篇 |
免费 | 149篇 |
国内免费 | 120篇 |
专业分类
电工技术 | 166篇 |
综合类 | 171篇 |
化学工业 | 44篇 |
金属工艺 | 37篇 |
机械仪表 | 120篇 |
建筑科学 | 54篇 |
矿业工程 | 20篇 |
能源动力 | 18篇 |
轻工业 | 20篇 |
水利工程 | 10篇 |
石油天然气 | 19篇 |
武器工业 | 10篇 |
无线电 | 127篇 |
一般工业技术 | 105篇 |
冶金工业 | 13篇 |
原子能技术 | 5篇 |
自动化技术 | 420篇 |
出版年
2024年 | 3篇 |
2023年 | 11篇 |
2022年 | 19篇 |
2021年 | 31篇 |
2020年 | 39篇 |
2019年 | 32篇 |
2018年 | 33篇 |
2017年 | 39篇 |
2016年 | 65篇 |
2015年 | 50篇 |
2014年 | 74篇 |
2013年 | 73篇 |
2012年 | 80篇 |
2011年 | 81篇 |
2010年 | 85篇 |
2009年 | 86篇 |
2008年 | 48篇 |
2007年 | 83篇 |
2006年 | 81篇 |
2005年 | 63篇 |
2004年 | 52篇 |
2003年 | 35篇 |
2002年 | 30篇 |
2001年 | 33篇 |
2000年 | 33篇 |
1999年 | 20篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 9篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有1359条查询结果,搜索用时 156 毫秒
1.
AbstractModel order reduction is a common practice to reduce large order systems so that their simulation and control become easy. Nonlinearity aware trajectory piecewise linear is a variation of trajectory piecewise linearization technique of order reduction that is used to reduce nonlinear systems. With this scheme, the reduced approximation of the system is generated by weighted sum of the linearized and reduced sub-models obtained at certain linearization points on the system trajectory. This scheme uses dynamically inspired weight assignment that makes the approximation nonlinearity aware. Just as weight assignment, the process of linearization points selection is also important for generating faithful approximations. This article uses a global maximum error controller based linearization points selection scheme according to which a state is chosen as a linearization point if the error between a current reduced model and the full order nonlinear system reaches a maximum value. A combination that not only selects linearization points based on an error controller but also assigns dynamic inspired weights is shown in this article. The proposed scheme generates approximations with higher accuracies. This is demonstrated by applying the proposed method to some benchmark nonlinear circuits including RC ladder network and inverter chain circuit and comparing the results with the conventional schemes. 相似文献
2.
为提高稀疏表示跟踪模型性能,提出一种分段加权的反向稀疏跟踪算法,将跟踪问题转化为在贝叶斯框架下寻找概率最高的候选对象问题,构造不同的分段权重函数来分别度量候选目标与正负模板的判别特征系数。通过池化来降低跟踪结果的不确定性干扰,选择正负模板加权系数差值最大的候选表示作为跟踪结果。实验表明,在光照变化、遮挡、快速运动、运动模糊情况下,所提出的算法可以确保跟踪结果的准确性和鲁棒性。 相似文献
3.
4.
We are concerned with the detection of edges—the location and amplitudes of jump discontinuities of piecewise smooth data realized in terms of its discrete grid values. We discuss the interplay between two approaches. One approach, realized in the physical space, is based on local differences and is typically limited to low-order of accuracy. An alternative approach developed in our previous work [Gelb and Tadmor, Appl. Comp. Harmonic Anal., 7, 101–135 (1999)] and realized in the dual Fourier space, is based on concentration factors; with a proper choice of concentration factors one can achieve higher-orders—in fact in [Gelb and Tadmor, SIAM J. Numer. Anal., 38, 1389–1408 (2001)] we constructed exponentially accurate edge detectors. Since the stencil of these highly-accurate detectors is global, an outside threshold parameter is required to avoid oscillations in the immediate neighborhood of discontinuities. In this paper we introduce an adaptive edge detection procedure based on a cross-breading between the local and global detectors. This is achieved by using the minmod limiter to suppress spurious oscillations near discontinuities while retaining high-order accuracy away from the jumps. The resulting method provides a family of robust, parameter-free edge-detectors for piecewise smooth data. We conclude with a series of one- and two-dimensional simulations.To David Gottlieb, on his 60th birthday, with friendship and appreciation. 相似文献
5.
Let us consider n data measurements of a univariate process that have been altered by random errors. We assume that an underlying model function has a substantially smaller number of turning points than the observed ones. We propose algorithms that make least the sum of the moduli of the errors by requiring k monotonic sections, alternately increasing and decreasing, in the sequence of the smoothed values. The main difficulty in this calculation is that the optimal positions of the joins of the monotonic sections have to be found automatically among so many combinations that it is impossible to test each one separately. Moreover, the calculation seems to be very intractable to general optimization techniques because O(nk ) local minima can occur. It is shown that dynamic programming can be used for separating the data into optimal disjoint sections of adjacent data, where each section requires a single L1 monotonic calculation. This procedure is highly efficient, requiring at most O(kn2 ) computer operations and O(n) best L1 monotonic calculations to subranges of data for a global minimum. 相似文献
6.
7.
本文对代数曲面的几何连续拼接作了研究,给出了多个代数曲面的几何连续过渡方法,同时给出了一种基于分片的曲面过渡方法。 相似文献
8.
9.
Eugene Fiume† 《Computer Graphics Forum》1995,14(1):47-58
The main preoccupations of research in computer-aided geometric design have been on shape-specification techniques for polynomial curves and surfaces, and on the continuity between segments or patches. When modelling with such techniques, curves and surfaces can be compressed or expanded arbitrarily. There has been relatively little work on interacting with direct spatial properties of curves and surfaces, such as their arc length or surface area. As a first step, we derive families of parametric piecewise polynomial curves that satisfy various positional and tangential constraints together with arc-length constraints. We call these curves isometric curves. A space curve is defined as a sequence of polynomial curve segments, each of which is defined by the familiar Hermite or Bézier constraints for cubic polynomials; as well, each segment is constrained to have a specified arc length. We demonstrate that this class of curves is attractive and stable. We also describe the numerical techniques used that are sufficient for achieving real time interaction with these curves on low-end workstations. 相似文献
10.
This paper addresses the problem of approximating parameter dependent nonlinear systems in a unified framework. This modeling has been presented for the first time in the form of parameter dependent piecewise affine systems. In this model, the matrices and vectors defining piecewise affine systems are affine functions of parameters. Modeling of the system is done based on distinct spaces of state and parameter, and the operating regions are partitioned into the sections that we call ’multiplied simplices’. It is proven that this method of partitioning leads to less complexity of the approximated model compared with the few existing methods for modeling of parameter dependent nonlinear systems. It is also proven that the approximation is continuous for continuous functions and can be arbitrarily close to the original one. Next, the approximation error is calculated for a special class of parameter dependent nonlinear systems. For this class of systems, by solving an optimization problem, the operating regions can be partitioned into the minimum number of hyper-rectangles such that the modeling error does not exceed a specified value. This modeling method can be the first step towards analyzing the parameter dependent nonlinear systems with a uniform method. 相似文献